Solution.rs

implSolution{
pubfngood_indices(nums:Vec<i32>,k:i32) -> Vec<i32>{
let k = k asusize;
let n = nums.len();
letmut prefix = vec![0; n];
letmut suffix = vec![0; n];
letmut count = (1,1);

for i in1..n {
 prefix[i] = count.0;
 suffix[n - 1 - i] = count.1;

if nums[i] <= nums[i - 1]{
 count.0 += 1;
}else{
 count.0 = 1;
}
if nums[n - 1 - i] <= nums[n - i]{
 count.1 += 1;
}else{
 count.1 = 1;
}
}

(k..n - k)
.filter(|&i| prefix[i].min(suffix[i]) >= k)
.map(|i| i asi32)
.collect()
}
}